Skip to content

Latest commit

 

History

History

0104-Maximum Depth of Binary Tree

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Iteration.py
Iteration.py
 
 
README.md
README.md
 
 
README_CN.md
README_CN.md
 
 
Recursion.py
Recursion.py
 
 

README.md

104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 return its depth = 3.

Solutions (Python)

1. Recursion

# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = NoneclassSolution: defmaxDepth(self, root: TreeNode) ->int: ifnotroot: return0lmax=self.maxDepth(root.left) rmax=self.maxDepth(root.right) returnmax(lmax, rmax) +1

2. Iteration

# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = NoneclassSolution: defmaxDepth(self, root: TreeNode) ->int: ifnotroot: return0depth=0nodes= [root] whilenodes: depth+=1nodes= [node.leftfornodeinnodesifnode.left] \ + [node.rightfornodeinnodesifnode.right] returndepth
close